/**
 * The MIT License
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 * THE SOFTWARE.
 */
package fr.inria.dataflow;

import fr.inria.controlflow.ControlFlowNode;

/**
 * Created by marodrig on 12/11/2015.
 */
public interface ControlFlowVisitor {

	/**
	 * Visit a node of the graph
	 * @param n Node to visit
	 * @return True if the running of the graph must stop
	 */
	boolean visitStatement(ControlFlowNode n);

	/**
	 * Visit a node of the graph
	 * @param n Node to visit
	 * @return True if the running of the graph must stop
	 */
	boolean visitBranch(ControlFlowNode n);

	/**
	 * Visit a node of the graph
	 * @param n Node to visit
	 * @return True if the running of the graph must stop
	 */
	boolean visitBegin(ControlFlowNode n);

	/**
	 * Visit a node of the graph
	 * @param n Node to visit
	 * @return True if the running of the graph must stop
	 */
	boolean visitBlockBegin(ControlFlowNode n);

	/**
	 * Visit a node of the graph
	 * @param n Node to visit
	 * @return True if the running of the graph must stop
	 */
	boolean visitBlockEnd(ControlFlowNode n);

	/**
	 * Visit a node of the graph
	 * @param n Node to visit
	 * @return True if the running of the graph must stop
	 */
	boolean visitConvergence(ControlFlowNode n);

	/**
	 * Visit a node of the graph
	 * @param n Node to visit
	 * @return True if the running of the graph must stop
	 */
	boolean visitExit(ControlFlowNode n);
}
